/**
 * 704. 二分查找
 * https://leetcode.cn/problems/binary-search/description/
 */
class Solution {
    public int search(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        int ret = -1;
        while(left <= right) {
            // int mid = (left + right) / 2;
            // 防溢出
            int mid = left + (right - left) / 2;
            if(nums[mid] < target) {
                left = mid + 1;
            } else if(nums[mid] > target) {
                right = mid - 1;
            } else {
                ret = mid;
                break;
            }
        }
        return ret;
    }
}